A Comparison of Hashing Schemes for Address Lookup in Computer Networks

摘要

Using a trace of address references, we compared the efficiency of severaldifferent hashing functions, such as cyclic redundancy checking (CRC)polynomials, Fletcher checksum, folding of address octets using theexclusive-or operation and bit extraction from the address. Guidelines areprovided for determining the size of the hashmark required to achieve aspecified level of performance.